Approximation Algorithms for Local Alignment with Length Constraints
نویسندگان
چکیده
منابع مشابه
Algorithms for Local Alignment with Length Constraints
The local sequence alignment problem is the detection of similar subsequences in two given sequences of lengths n m. Unfortunately the common notion of local alignment suuers from some well-known anomalies which result from not taking into account the lengths of the aligned subsequences. We introduce the length restricted local alignment problem which includes as a constraint an upper limit T o...
متن کاملOPTIMIZATION OF VERTICAL ALIGNMENT OF HIGHWAYS IN TERMS OF EARTHWORK COST USING COLLIDING BODIES OPTIMIZATION ALGORITHM
One of the most important factors that affects construction costs of highways is the earthwork cost. On the other hand, the earthwork cost strongly depends on the design of vertical alignment or project line. In this study, at first, the problem of vertical alignment optimization was formulated. To this end, station, elevation and vertical curve length in case of each point of vertical intersec...
متن کاملEffect of Objective Function on the Optimization of Highway Vertical Alignment by Means of Metaheuristic Algorithms
The main purpose of this work is the comparison of several objective functions for optimization of the vertical alignment. To this end, after formulation of optimum vertical alignment problem based on different constraints, the objective function was considered as four forms including: 1) the sum of the absolute value of variance between the vertical alignment and the existing ground; 2) the su...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملDynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints
Pairwise local alignment is one of the most important problems in sequence analysis in computational biology. Classical dynamic programming solution to this problem searches for two segments with maximum similarity score by discarding poorly conserved initial and terminal fragments. As a consequence, an alignment returned as optimal may contain a mosaic of well-conserved fragments arti cially c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 13 شماره
صفحات -
تاریخ انتشار 2002